Pii: S0898-1221(96)00223-4

نویسنده

  • W. GAUTSCHI
چکیده

Abs t r ac t -An account is given of the role played by moments and modified moments in the construction of quadrature rules, specifically weighted Newton-Cotes and Gaussian rules. Fast and slow Lagrange interpolation algorithms, combined with Gaussian quadrature, as well as linear algebra methods based on moment equations, axe described for generating Newton-Cotes formulae. The weaknesses and strengths of these methods axe illustrated in concrete examples involving weight functions with and without singularities. New conjectures are formulated concerning the positivity of certain Newton-Cotes formulae for Jacobi weight functions and for the logistics weight, with numerical evidence being provided to support them. Finally, an inherent limitation is pointed out in the use of moment information to construct Gauss-type quadrature rules for the Hermite weight function on bounded or half-infinite intervals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0898-1221(99)00168-6

Abstrac t -We consider in this paper, an r-quorum queueing system with random server capacity under N-policy discipline (hysteretic system). We find a necessary and sufficient condition for ergodicity, the probability generating function of the steady state vector of probabilities for the embedded process and the continuous time parameter, and some system characteristics. The decomposition prop...

متن کامل

Pii: S0898-1221(99)00192-3

We consider the following boundary value problem: where 1 < p _< n-1 is fixed and A > 0. A characterization of the values of A is carried out so that the boundary value problem has a positive solution. Next, for A = 1, criteria are developed for the existence of two positive solutions of the boundary value problem. In addition, for particular cases we also offer upper and lower bounds for these...

متن کامل

Pii: S0898-1221(99)00323-5

K e y w o r d s P r o j e c t i o n , Simplex method, Least squares problem, LU decomposition, Crash heuristic. 1. I N T R O D U C T I O N We are concerned with the Linear P rogramming (LP) problem in the s t anda rd form

متن کامل

Pii: S0898-1221(01)00281-4

Abst rac t -Dynamic rent-seeking games with nonlinear cost functions are analyzed. The local asymptotic stability of the solution is first examined. We show that in the absence of a dominant agent, all eigenvalues of the Jacobian are real. Conditions are given for the local asymptotic stability as well as for the local instability of the equilibrium. In the presence of a dominant agent, complex...

متن کامل

Pii: S0898-1221(02)00258-4

We study iterative methods for solving linear systems arising in the discretization of the time dependent neutron diffusion equation. These methods are obtained accelerating two different stationary iterative methods, of second degree type, with a variational technique. We have obtained some results concerning the convergence and the selection of the optimal extrapolation factor for some partic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002